The Generalized Approximate Regularities in Strings
نویسندگان
چکیده
We concentrate on the generalized string regularities and study the minimum approximate λ-cover problem and the minimum approximate λ-seed problem of a string. Given a string x of length n and an integer λ, the minimum approximate λ-cover (resp. seed) problem is to find a set of λ substrings each of equal length that covers x (resp. a superstring of x) with the minimum error, under a variety of distance models containing the Hamming distance, the edit distance and the weighted edit distance. Both problems can be solved in polynomial time.
منابع مشابه
Approximate Periods of Strings for Absolute Distances
Approximate periods of strings can be used to find approximate repetitive regularities in strings. In this paper we consider the approximate period problem for different absolute distances.
متن کاملAlgorithms for Computing the λ-regularities in Strings
We introduce the notion of λ-regularities in strings that consist of λ-covers and λ-seeds, and study three λ-regularities problems— the λ-cover problem, the general λ-cover problem and the λ-seed problem in this paper. λ-regularities can be viewed as generalized string regularities in the sense that a set of λ repetitive strings rather than a single repeated string are considered. We first pres...
متن کاملCombinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions
Classically in combinatorics on words one studies unavoidable regularities that appear in sufficiently long strings of symbols over a fixed size alphabet. In this paper we take another viewpoint and focus on combinatorial properties of long words in which the number of occurrences of any symbol is restritced by a fixed constant. We then demonstrate the connection of these properties to construc...
متن کاملOn Approximate Solutions of the Generalized Radical Cubic Functional Equation in Quasi-$beta$-Banach Spaces
In this paper, we prove the generalized Hyers-Ulam-Rassias stability of the generalized radical cubic functional equation[ fleft( sqrt[3]{ax^3 + by^3}right)=af(x) + bf(y),] where $a,b in mathbb{R}_+$ are fixed positive real numbers, by using direct method in quasi-$beta$-Banach spaces. Moreover, we use subadditive functions to investigate stability of the generaliz...
متن کاملA Piecewise Approximate Method for Solving Second Order Fuzzy Differential Equations Under Generalized Differentiability
In this paper a numerical method for solving second order fuzzy differential equations under generalized differentiability is proposed. This method is based on the interpolating a solution by piecewise polynomial of degree 4 in the range of solution. Moreover we investigate the existence, uniqueness and convergence of approximate solutions. Finally the accuracy of piecewise approximate method b...
متن کامل